Generating Trees on Multisets
نویسندگان
چکیده
Given a multiset M = V1 ∪ V2 ∪ · · · ∪ VC of n elements and a capacity function ∆ : [1, C] → [2, n− 1], we consider the problem of enumerating all unrooted trees T on M such that the degree of each vertex v ∈ Vi is bounded from above by ∆(i). The problem has a direct application of enumerating isomers of tree-like chemical graphs. We give an algorithm that generates all such trees without duplication in O(1)-time delay per output in the worst case using O(n) space.
منابع مشابه
Functional Dependencies with Counting on Trees
The paper presents an axiomatisation for functional dependencies on trees that are defined using constructors for records, lists, sets and multisets. A simple form of restructuring permitting lists to be mapped onto multisets and multisets onto sets is added to the theory. Furthermore, the theory handles dependencies on sets treated as multisets. This adds the possibility to use the count of el...
متن کاملProbabilistic reasoning with terms
Many problems in artificial intelligence can be naturally approached by generating and manipulating probability distributions over structured objects. In this paper we represent structured objects by first-order logic terms (lists, trees, tuples, and nestings thereof) and higher-order terms (sets, multisets), and we study the question how to define probability distributions over such terms. We ...
متن کاملGeneral definitions for the union and intersection of ordered fuzzy multisets
Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...
متن کاملMultiset-based Tree Model for Membrane Computing
In this paper, we introduce a new paradigm multiset-based tree model. We show that trees can be represented in the form of wellfounded multisets. We also show that the conventional approach for this representation is not injective from a set of trees to the class of multisets representing such trees. We establish a oneto-one correspondence between trees and suitable permutations of a wellfounde...
متن کاملFinality regained: A coalgebraic study of Scott-sets and multisets
In this paper we study iterated circular multisets in a coalgebraic framework. We will produce two essentially di erent universes of such sets. The unisets of the rst universe will be shown to be precisely the sets of the Scott universe. The unisets of the second universe will be precisely the sets of the AFA-universe. We will have a closer look into the connection of the iterated circular mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010